Verification of Multi-Party Ping-Pong Protocols via Program Transformation

نویسنده

  • Antonina Nepeivoda
چکیده

The paper describes a verification technique based on program transformation with unfolding. The technique allows to find short attacks on multi-party ping-pong protocols in the Dolev–Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered. Examples of model programs for protocols were written in a functional language and were analyzed by a general-purpose supercompiler.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide cont...

متن کامل

Ping-Pong Protocols as Prefix Grammars and Turchin Relation

This paper describes how to verify cryptographic protocols by a general-purpose program transformation technique with unfolding. The questions of representation and analysis of the protocols as prefix rewriting grammars are discussed. In these aspects Higman and Turchin embeddings on computational paths are considered, and a refinement of Turchin’s relation is presented that allows to algorithm...

متن کامل

On the Security of Ping-Pong Protocols when Implemented using the RSA

The Security of the RSA implementation of ping-pong protocols is considered. It is shown that the obvious RSA properties, such as "multiplicativity", do not endanger the security of ping-pong protocols. Namely, if a ping-pong protocol is secure in general then its implementation using an "ideal RSA" is also secure.

متن کامل

Citronellyl Butyrate Synthesis in Non-Conventional Media Using Packed-Bed Immobilized Candida Rugosa Lipase Reactor

The synthesis of citronellyl butyrate by direct esterification reaction catalyzed by immobilized lipase from Candida rugosa was studied in a continuous packed bed reactor using n-hexane as organic solvent. Parameters such as residence time, temperature, and pH were examined. The optimum conversion was obtained at a flow rate of 1 ml/min (residence time 8 min), temperature of 50 °C, and pH 7.5. ...

متن کامل

Eavesdropping on the “ping-pong” type quantum communication protocols with invisible photon

The crucial issue of quantum communication protocol is its security. A quantum communication scheme must be based on the existing or nearly existing technology, but its security must be guaranteed against an eavesdropper whose technology is limited only by the laws of quantum mechanics. In this paper, we show that all the deterministic and direct two-way quantum communication protocols, sometim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014